0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n004.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 960
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Aug  9 04:37:35 EDT 2022
0.13/0.34	% CPUTime    : 
0.19/0.47	Running higher-order on 8 cores theorem proving
0.19/0.47	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.48	# Version: 3.0pre003-ho
0.19/0.49	# Preprocessing class: HSSSSMSSSLMNHSN.
0.19/0.49	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.19/0.49	# Starting ho_unfolding_6 with 600s (5) cores
0.19/0.49	# Starting ehoh_best_sine_rwall with 120s (1) cores
0.19/0.49	# Starting sh2l with 120s (1) cores
0.19/0.49	# Starting ehoh_best_nonlift_rwall with 120s (1) cores
0.19/0.49	# sh2l with pid 30720 completed with status 0
0.19/0.49	# Result found by sh2l
0.19/0.49	# Preprocessing class: HSSSSMSSSLMNHSN.
0.19/0.49	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.19/0.49	# Starting ho_unfolding_6 with 600s (5) cores
0.19/0.49	# Starting ehoh_best_sine_rwall with 120s (1) cores
0.19/0.49	# Starting sh2l with 120s (1) cores
0.19/0.49	# SinE strategy is gf120_gu_RUU_F100_L01000
0.19/0.49	# ...ProofStateSinE()=3/21
0.19/0.49	# Search class: HGUSS-FFSF33-MHSFMFNN
0.19/0.49	# partial match(3): HGUSF-FFSF32-MHFFMFNN
0.19/0.49	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.19/0.49	# Starting new_ho_10 with 65s (1) cores
0.19/0.49	# new_ho_10 with pid 30725 completed with status 9
0.19/0.49	# Starting sh2l with 13s (1) cores
0.19/0.49	# sh2l with pid 30734 completed with status 0
0.19/0.49	# Result found by sh2l
0.19/0.49	# Preprocessing class: HSSSSMSSSLMNHSN.
0.19/0.49	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.19/0.49	# Starting ho_unfolding_6 with 600s (5) cores
0.19/0.49	# Starting ehoh_best_sine_rwall with 120s (1) cores
0.19/0.49	# Starting sh2l with 120s (1) cores
0.19/0.49	# SinE strategy is gf120_gu_RUU_F100_L01000
0.19/0.49	# ...ProofStateSinE()=3/21
0.19/0.49	# Search class: HGUSS-FFSF33-MHSFMFNN
0.19/0.49	# partial match(3): HGUSF-FFSF32-MHFFMFNN
0.19/0.49	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.19/0.49	# Starting new_ho_10 with 65s (1) cores
0.19/0.49	# new_ho_10 with pid 30725 completed with status 9
0.19/0.49	# Starting sh2l with 13s (1) cores
0.19/0.49	# Preprocessing time       : 0.001 s
0.19/0.49	# Presaturation interreduction done
0.19/0.49	
0.19/0.49	# Proof found!
0.19/0.49	# SZS status Theorem
0.19/0.49	# SZS output start CNFRefutation
0.19/0.49	thf(decl_22, type, in: $i > $i > $o).
0.19/0.49	thf(decl_23, type, emptyset: $i).
0.19/0.49	thf(decl_24, type, setadjoin: $i > $i > $i).
0.19/0.49	thf(decl_25, type, dsetconstr: $i > ($i > $o) > $i).
0.19/0.49	thf(decl_26, type, subset: $i > $i > $o).
0.19/0.49	thf(decl_27, type, kpair: $i > $i > $i).
0.19/0.49	thf(decl_28, type, cartprod: $i > $i > $i).
0.19/0.49	thf(decl_29, type, singleton: $i > $o).
0.19/0.49	thf(decl_30, type, ex1: $i > ($i > $o) > $o).
0.19/0.49	thf(decl_31, type, breln: $i > $i > $i > $o).
0.19/0.49	thf(decl_32, type, dpsetconstr: $i > $i > ($i > $i > $o) > $i).
0.19/0.49	thf(decl_33, type, func: $i > $i > $i > $o).
0.19/0.49	thf(decl_34, type, lamProp: $o).
0.19/0.49	thf(decl_35, type, lam: $i > $i > ($i > $i) > $i).
0.19/0.49	thf(decl_36, type, esk1_3: $i > $i > ($i > $i) > $i).
0.19/0.49	thf(decl_37, type, esk2_0: $i).
0.19/0.49	thf(decl_38, type, esk3_0: $i).
0.19/0.49	thf(decl_39, type, esk4_0: $i > $i).
0.19/0.49	thf(decl_40, type, epred1_0: $i > $i > $o).
0.19/0.49	thf(decl_41, type, epred2_1: ($i > $i) > $i > $i > $o).
0.19/0.49	thf(decl_42, type, esk5_1: ($i > $i) > $i).
0.19/0.49	thf(decl_43, type, esk6_1: ($i > $i) > $i).
0.19/0.49	thf(decl_44, type, esk7_0: $i).
0.19/0.49	thf(decl_45, type, esk8_0: $i).
0.19/0.49	thf(decl_46, type, esk9_1: ($i > $i) > $i).
0.19/0.49	thf(decl_47, type, esk10_1: ($i > $i) > $i).
0.19/0.49	thf(decl_48, type, esk11_1: ($i > $i) > $i).
0.19/0.49	thf(decl_49, type, esk12_0: $i).
0.19/0.49	thf(decl_50, type, esk13_0: $i).
0.19/0.49	thf(lam, axiom, ((lam)=(^[X1:$i, X4:$i, X8:$i > $i]:(dpsetconstr @ X1 @ X4 @ (^[X2:$i, X7:$i]:(((X8 @ X2)=(X7))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', lam)).
0.19/0.49	thf(lamProp, axiom, ((lamProp)<=>![X1:$i, X4:$i, X8:$i > $i]:((![X2:$i]:(((in @ X2 @ X1)=>(in @ (X8 @ X2) @ X4)))=>(func @ X1 @ X4 @ (dpsetconstr @ X1 @ X4 @ (^[X2:$i, X7:$i]:(((X8 @ X2)=(X7))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', lamProp)).
0.19/0.49	thf(lamp, conjecture, ((lamProp)=>![X1:$i, X4:$i, X8:$i > $i]:((![X2:$i]:(((in @ (X8 @ X2) @ X4)<=(in @ X2 @ X1)))=>(func @ X1 @ X4 @ (lam @ X1 @ X4 @ (^[X2:$i]:(X8 @ X2))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', lamp)).
0.19/0.49	thf(c_0_3, plain, ((lam)=(^[Z0:$i, Z1:$i, Z2:$i > $i]:(dpsetconstr @ Z0 @ Z1 @ (^[Z3:$i, Z4:$i]:(((Z2 @ Z3)=(Z4))))))), inference(fof_simplification,[status(thm)],[lam])).
0.19/0.49	thf(c_0_4, plain, ((lamProp)<=>![X1:$i, X4:$i, X8:$i > $i]:((![X2:$i]:(((in @ X2 @ X1)=>(in @ (X8 @ X2) @ X4)))=>(func @ X1 @ X4 @ (dpsetconstr @ X1 @ X4 @ (^[Z0:$i, Z1:$i]:(((X8 @ Z0)=(Z1))))))))), inference(fof_simplification,[status(thm)],[lamProp])).
0.19/0.49	thf(c_0_5, negated_conjecture, ~((![X17:$i, X18:$i, X19:$i > $i]:((![X20:$i]:(((in @ X20 @ X17)=>(in @ (X19 @ X20) @ X18)))=>(func @ X17 @ X18 @ (dpsetconstr @ X17 @ X18 @ (^[Z0:$i]:($eq @ (X19 @ Z0)))))))=>![X1:$i, X4:$i, X8:$i > $i]:((![X2:$i]:(((in @ X2 @ X1)=>(in @ (X8 @ X2) @ X4)))=>(func @ X1 @ X4 @ (dpsetconstr @ X1 @ X4 @ (^[Z0:$i]:($eq @ (X8 @ Z0))))))))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[lamp])]), c_0_3]), c_0_4])])])).
0.19/0.49	thf(c_0_6, negated_conjecture, ![X21:$i, X22:$i, X23:$i > $i, X28:$i]:(((((in @ (esk1_3 @ X21 @ X22 @ X23) @ X21)|(func @ X21 @ X22 @ (dpsetconstr @ X21 @ X22 @ (^[Z0:$i]:($eq @ (X23 @ Z0))))))&(~(in @ (X23 @ (esk1_3 @ X21 @ X22 @ X23)) @ X22)|(func @ X21 @ X22 @ (dpsetconstr @ X21 @ X22 @ (^[Z0:$i]:($eq @ (X23 @ Z0)))))))&((~(in @ X28 @ esk2_0)|(in @ (esk4_0 @ X28) @ esk3_0))&~(func @ esk2_0 @ esk3_0 @ (dpsetconstr @ esk2_0 @ esk3_0 @ (^[Z0:$i]:($eq @ (esk4_0 @ Z0)))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])).
0.19/0.49	thf(c_0_7, plain, ![X29:$i]:(((epred1_0 @ X29)=($eq @ (esk4_0 @ X29)))), introduced(definition)).
0.19/0.49	thf(c_0_8, plain, ![X30:$i, X8:$i > $i]:(((epred2_1 @ X8 @ X30)=($eq @ (X8 @ X30)))), introduced(definition)).
0.19/0.49	thf(c_0_9, negated_conjecture, ~((((func @ esk2_0 @ esk3_0 @ (dpsetconstr @ esk2_0 @ esk3_0 @ epred1_0)))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_6]), c_0_7])).
0.19/0.49	thf(c_0_10, negated_conjecture, ![X1:$i, X8:$i > $i, X2:$i]:(((((func @ X1 @ X2 @ (dpsetconstr @ X1 @ X2 @ (epred2_1 @ X8))))=(($true)))|~((in @ (X8 @ (esk1_3 @ X1 @ X2 @ X8)) @ X2)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_6]), c_0_8])).
0.19/0.49	thf(c_0_11, negated_conjecture, ~((func @ esk2_0 @ esk3_0 @ (dpsetconstr @ esk2_0 @ esk3_0 @ epred1_0))), inference(cn,[status(thm)],[c_0_9])).
0.19/0.49	thf(c_0_12, negated_conjecture, ![X1:$i, X8:$i > $i, X2:$i]:(((func @ X1 @ X2 @ (dpsetconstr @ X1 @ X2 @ (epred2_1 @ X8)))|~((in @ (X8 @ (esk1_3 @ X1 @ X2 @ X8)) @ X2)))), inference(cn,[status(thm)],[c_0_10])).
0.19/0.49	thf(c_0_13, plain, ![X8:$i > $i]:((((epred2_1 @ X8)!=(epred1_0))|~((in @ (X8 @ (esk1_3 @ esk2_0 @ esk3_0 @ X8)) @ esk3_0)))), inference(er,[status(thm)],[inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_11, c_0_12])])])).
0.19/0.49	thf(c_0_14, negated_conjecture, ![X1:$i]:(((in @ (esk4_0 @ X1) @ esk3_0)|~((in @ X1 @ esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.19/0.49	thf(c_0_15, plain, ![X32:$i, X33:$i > $i]:(((epred2_1 @ X33 @ X32)=($eq @ (X33 @ X32)))), inference(variable_rename,[status(thm)],[])).
0.19/0.49	thf(c_0_16, plain, ![X34:$i]:(((epred1_0 @ X34)=($eq @ (esk4_0 @ X34)))), inference(variable_rename,[status(thm)],[])).
0.19/0.49	thf(c_0_17, negated_conjecture, ![X1:$i, X2:$i, X8:$i > $i]:(((in @ (esk1_3 @ X1 @ X2 @ X8) @ X1)|(((func @ X1 @ X2 @ (dpsetconstr @ X1 @ X2 @ (epred2_1 @ X8))))=(($true))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_6]), c_0_8])).
0.19/0.49	thf(c_0_18, negated_conjecture, (((epred2_1 @ esk4_0)!=(epred1_0))|~((in @ (esk1_3 @ esk2_0 @ esk3_0 @ esk4_0) @ esk2_0))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
0.19/0.49	thf(c_0_19, plain, ![X8:$i > $i, X1:$i]:(((epred2_1 @ X8 @ X1)=($eq @ (X8 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_15])).
0.19/0.49	thf(c_0_20, plain, ![X1:$i]:(((epred1_0 @ X1)=($eq @ (esk4_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.19/0.49	thf(c_0_21, negated_conjecture, ![X8:$i > $i, X2:$i, X1:$i]:(((func @ X1 @ X2 @ (dpsetconstr @ X1 @ X2 @ (epred2_1 @ X8)))|(in @ (esk1_3 @ X1 @ X2 @ X8) @ X1))), inference(cn,[status(thm)],[c_0_17])).
0.19/0.49	thf(c_0_22, negated_conjecture, ~((in @ (esk1_3 @ esk2_0 @ esk3_0 @ esk4_0) @ esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_18]), c_0_19]), c_0_20])])).
0.19/0.49	thf(c_0_23, plain, ![X8:$i > $i]:(((in @ (esk1_3 @ esk2_0 @ esk3_0 @ X8) @ esk2_0)|((epred2_1 @ X8)!=(epred1_0)))), inference(er,[status(thm)],[inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_11, c_0_21])])])).
0.19/0.49	thf(c_0_24, negated_conjecture, ((epred2_1 @ esk4_0)!=(epred1_0)), inference(spm,[status(thm)],[c_0_22, c_0_23])).
0.19/0.49	thf(c_0_25, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_24]), c_0_19]), c_0_20])]), ['proof']).
0.19/0.49	# SZS output end CNFRefutation
0.19/0.49	# Parsed axioms                        : 21
0.19/0.49	# Removed by relevancy pruning/SinE    : 18
0.19/0.49	# Initial clauses                      : 6
0.19/0.49	# Removed in clause preprocessing      : 0
0.19/0.49	# Initial clauses in saturation        : 6
0.19/0.49	# Processed clauses                    : 25
0.19/0.49	# ...of these trivial                  : 0
0.19/0.49	# ...subsumed                          : 2
0.19/0.49	# ...remaining for further processing  : 22
0.19/0.49	# Other redundant clauses eliminated   : 5
0.19/0.49	# Clauses deleted for lack of memory   : 0
0.19/0.49	# Backward-subsumed                    : 1
0.19/0.49	# Backward-rewritten                   : 0
0.19/0.49	# Generated clauses                    : 28
0.19/0.49	# ...of the previous two non-redundant : 23
0.19/0.49	# ...aggressively subsumed             : 0
0.19/0.49	# Contextual simplify-reflections      : 0
0.19/0.49	# Paramodulations                      : 4
0.19/0.49	# Factorizations                       : 0
0.19/0.49	# NegExts                              : 9
0.19/0.49	# Equation resolutions                 : 5
0.19/0.49	# Propositional unsat checks           : 0
0.19/0.49	#    Propositional check models        : 0
0.19/0.49	#    Propositional check unsatisfiable : 0
0.19/0.49	#    Propositional clauses             : 0
0.19/0.49	#    Propositional clauses after purity: 0
0.19/0.49	#    Propositional unsat core size     : 0
0.19/0.49	#    Propositional preprocessing time  : 0.000
0.19/0.49	#    Propositional encoding time       : 0.000
0.19/0.49	#    Propositional solver time         : 0.000
0.19/0.49	#    Success case prop preproc time    : 0.000
0.19/0.49	#    Success case prop encoding time   : 0.000
0.19/0.49	#    Success case prop solver time     : 0.000
0.19/0.49	# Current number of processed clauses  : 12
0.19/0.49	#    Positive orientable unit clauses  : 1
0.19/0.49	#    Positive unorientable unit clauses: 1
0.19/0.49	#    Negative unit clauses             : 3
0.19/0.49	#    Non-unit-clauses                  : 7
0.19/0.49	# Current number of unprocessed clauses: 10
0.19/0.49	# ...number of literals in the above   : 21
0.19/0.49	# Current number of archived formulas  : 0
0.19/0.49	# Current number of archived clauses   : 10
0.19/0.49	# Clause-clause subsumption calls (NU) : 9
0.19/0.49	# Rec. Clause-clause subsumption calls : 7
0.19/0.49	# Non-unit clause-clause subsumptions  : 0
0.19/0.49	# Unit Clause-clause subsumption calls : 3
0.19/0.49	# Rewrite failures with RHS unbound    : 0
0.19/0.49	# BW rewrite match attempts            : 2
0.19/0.49	# BW rewrite match successes           : 2
0.19/0.49	# Condensation attempts                : 0
0.19/0.49	# Condensation successes               : 0
0.19/0.49	# Termbank termtop insertions          : 1919
0.19/0.49	
0.19/0.49	# -------------------------------------------------
0.19/0.49	# User time                : 0.010 s
0.19/0.49	# System time              : 0.001 s
0.19/0.49	# Total time               : 0.011 s
0.19/0.49	# Maximum resident set size: 1932 pages
0.19/0.49	
0.19/0.49	# -------------------------------------------------
0.19/0.49	# User time                : 0.011 s
0.19/0.49	# System time              : 0.003 s
0.19/0.49	# Total time               : 0.015 s
0.19/0.49	# Maximum resident set size: 1736 pages
0.19/0.49	EOF